41![Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs ∗ L´aszl´o Babai † Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs ∗ L´aszl´o Babai †](https://www.pdfsearch.io/img/23126f7fbe533d9c1fe82e5c4d999106.jpg) | Add to Reading ListSource URL: page.mi.fu-berlin.deLanguage: English - Date: 2008-09-03 14:36:17
|
---|
42![Connecting Obstacles in Vertex-Disjoint Paths Marwan Al-Jubeh∗ Gill Barequet†∗ Mashhood Ishaque∗ Connecting Obstacles in Vertex-Disjoint Paths Marwan Al-Jubeh∗ Gill Barequet†∗ Mashhood Ishaque∗](https://www.pdfsearch.io/img/9fd8aaf1776cbc86b0723d5d59ed094a.jpg) | Add to Reading ListSource URL: www.eecs.tufts.eduLanguage: English - Date: 2010-03-17 17:57:11
|
---|
43![Bayesian nonparametric models for bipartite graphs Fran¸cois Caron Department of Statistics, Oxford Statistics Colloquium, Harvard University Bayesian nonparametric models for bipartite graphs Fran¸cois Caron Department of Statistics, Oxford Statistics Colloquium, Harvard University](https://www.pdfsearch.io/img/f6a1a432f5249798a898d74e5ad13f0e.jpg) | Add to Reading ListSource URL: www.stats.ox.ac.ukLanguage: English - Date: 2013-11-11 14:27:59
|
---|
44![Proximity Tracking on Time-Evolving Bipartite Graphs Spiros Papadimitriou† Abstract Given an author-conference network that evolves over time, which are the conferences that a given author is most closely Proximity Tracking on Time-Evolving Bipartite Graphs Spiros Papadimitriou† Abstract Given an author-conference network that evolves over time, which are the conferences that a given author is most closely](https://www.pdfsearch.io/img/dcff694a343644cbadf255cf22b08a77.jpg) | Add to Reading ListSource URL: www.cs.cmu.eduLanguage: English - Date: 2008-07-16 16:24:39
|
---|
45![Bayesian nonparametric models for bipartite graphs Franc¸ois Caron INRIA IMB - University of Bordeaux Talence, France Bayesian nonparametric models for bipartite graphs Franc¸ois Caron INRIA IMB - University of Bordeaux Talence, France](https://www.pdfsearch.io/img/97f65794df68fd971dd5b13ef475e99a.jpg) | Add to Reading ListSource URL: papers.nips.ccLanguage: English - Date: 2014-03-25 03:44:48
|
---|
46![Sheep: A Scalable Distributed Graph Partitioner Daniel Margo Margo Seltzer Algorithm Problem Sheep: A Scalable Distributed Graph Partitioner Daniel Margo Margo Seltzer Algorithm Problem](https://www.pdfsearch.io/img/0e85f941b2391477ff1b2feaf85dc5f1.jpg) | Add to Reading ListSource URL: acmsocc.github.ioLanguage: English - Date: 2016-02-21 03:10:50
|
---|
47![Improved Approximation Algorithms for Graph-TSP in k -Regular Bipartite Graphs Jeremy Karp Improved Approximation Algorithms for Graph-TSP in k -Regular Bipartite Graphs Jeremy Karp](https://www.pdfsearch.io/img/f555b18e7cf890b1823d2a12c563efe6.jpg) | Add to Reading ListSource URL: www.andrew.cmu.eduLanguage: English - Date: 2015-06-15 09:50:33
|
---|
48![#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Nonuniqueness Region Jin-Yi Cai∗ Andreas Galanis† #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Nonuniqueness Region Jin-Yi Cai∗ Andreas Galanis†](https://www.pdfsearch.io/img/17205ca654c21187a29fae4b6901172a.jpg) | Add to Reading ListSource URL: pages.cs.wisc.eduLanguage: English - Date: 2014-04-26 17:03:21
|
---|
49![ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least](https://www.pdfsearch.io/img/01abb2e3e576a3a77cf32a0d32764cee.jpg) | Add to Reading ListSource URL: homepages.wmich.eduLanguage: English - Date: 2016-03-15 19:27:05
|
---|
50![b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1](https://www.pdfsearch.io/img/301917bdfcdd8da975e9e9bd5392004b.jpg) | Add to Reading ListSource URL: www.zaik.uni-koeln.deLanguage: English - Date: 2014-02-09 09:55:11
|
---|